Solving an integrated job-shop problem with human resource constraints
نویسندگان
چکیده
منابع مشابه
Solving an integrated job-shop problem with human resource constraints
We propose two exact methods to solve an integrated employee-timetable and job-shop-scheduling problem. The problem is to find a minimum cost employee-timetable, where employees have different competences and work during shifts, so that the production, that corresponds to a job-shop with resource availability constraints, can be achieved. We introduce two new exact procedures: 1) a decompositio...
متن کاملAn Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints
Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...
متن کاملSolving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and job-shop scheduling problem. Each method we investigate uses a constraint programming (CP) formulation associated with a linear programming (LP) relaxation. Under a CP framework, the LP-relaxation is integrated into a global constraint using in addition reduc...
متن کاملFuzzy job shop scheduling problem with availability constraints
This paper presents the fuzzy job shop scheduling problem with availability constraints. The objective is to find a schedule that maximizes the minimum agreement index subject to periodic maintenance, nonresumable jobs and fuzzy due-date. A random key genetic algorithm (RKGA) is proposed for the problem, in which a novel random key representation, a new decoding strategy incorporating maintenan...
متن کاملA job-shop problem with one additional resource type
We consider a job shop scheduling problem with n jobs and the constraint that at most p < n jobs can be processed simultaneously. This model arises in several manufacturing processes, where each operation has to be assisted by one human operator and there are p (versatile) operators. The problem is binary NP-hard even with n = 3 and p = 2. When the number of jobs is fixed, we give a pseudopolyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2012
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-012-1132-3